Eccentricity Properties of Glue Graphs
نویسندگان
چکیده
For any graph G, the Equi-eccentric point set graph Gee is defined on the same set of vertices by joining two vertices in Gee if and only if they correspond to two vertices of G with equal eccentricities. The Glue graph Gg is defined on the same set of vertices by joining two vertices in Gg if and only if they correspond to two adjacent vertices of G or two adjacent vertices of Gee. In this paper, radius and diameter of Glue graphs are studied. Eccentricity of each vertex of a glue graph is analyzed. Bounds for radius and diameter of a glue graph are given. Also, radius and diameter of glue graphs under certain conditions are found.
منابع مشابه
Average Degree-Eccentricity Energy of Graphs
The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.
متن کاملThe Center and Periphery of Composite Graphs
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nan...
متن کاملWiener Index of Graphs in Terms of Eccentricities
The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.
متن کاملEccentric Connectivity Index of Some Dendrimer Graphs
The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.
متن کاملOPEX: Optimized Eccentricity Computation in Graphs
Real-world graphs have many properties of interest, but often these properties are expensive to compute. We focus on eccentricity, radius and diameter in this work. These properties are useful measures of the global connectivity patterns in a graph. Unfortunately, computing eccentricity for all nodes is O(n) for a graph with n nodes. We present OPEX, a novel combination of optimizations which i...
متن کامل